#ifndef SEGTREE_H
#define SEGTREE_H
#include "includes.h"

class seeker
{
public:
    short a, b, count;
    seeker* left, *right;
    seeker(short m=0, short n=(CHUNK_SIZE*CHUNK_SIZE*CHUNK_SIZE-1));
    bool add(short n);
    bool remove(short n);
    bool isfull();
    bool isleaf();
    bool isempty();
};

#endif // LNOCTREE_H
